From Linear to Nonlinear: Some Complexity Comparisons - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
نویسنده
چکیده
This paper deals with the computational complexity, and in some cases undecidability, of several problems in nonlinear control. The objective is to compare the theoretical difficulty of solving such problems to the corresponding problems for linear systems. In particular, the problem of null-controllability for systems with saturations (of a “neural network” type) is mentioned, as well as problems regarding piecewise linear (hybrid) systems. A comparison of accessibility, which can be checked fairly simply by Lie-algebraic methods, and controllability, which is at least NP-hard for bilinear systems, is carried out. Finally, some remarks are given on analog computation in this context.
منابع مشابه
ON CONSTRUCTING A SHORTEST LINEAR RECURRENCE RELATION - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
In 1968, Berlekamp and Massey presented an algorithm to compute a shortest linear recurrence relation for a finite sequence of numbers. It was originally designed for the purpose of decoding certain types of block codes. It later became important for cryptographic applications, namely for determining the complexity profile of a sequence of numbers. Here, we interpret the Berlekamp-Massey algori...
متن کاملGeneric Eigenvalue Assignment for Generalized Linear First Order Systems using Memoryless Real Outpu - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
We show in this paper that arbitrary pole assignment by memoryless feedback is generically possible in the class of generalized first order system of a fixed McMillan degree n as soon as n is strictly less than the input number times the output number. Our result generalizes results by the authors covering the situation when the set of plants consists of strictly proper transfer functions only.
متن کاملOn the Stabilization of a Class of Nonholonomic Systems Using Invariant Manifold Technique - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
This paper presents an asymptotically stabilizing discontinuous feedback controller for a class of nonholonoinic systems. The controller consists of two parts: the first part yields an invariant manifold on which all trajectories of the closed-loop system tend to the origin, and the latter part renders the invariant manifold attractive, while avoiding a discontinuity surface. The controller yie...
متن کاملA SIMPLE PROOF THAT n < m * p IMPLIES GENERIC EIGENVALUE ASSIGNABILITY BY REAL MEMORYLESS OUTPUT FEE - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
In this talk we will give a simple proof of the remarkable result by Alex Wang [6] which states that if n < m * p , then generically the controlled eigenvalues can be assigned arbitrarily by real memoryless output feedback in a linear system with n states, m inputs, and p outputs.
متن کاملStability Criteria of Discrete-Time Analog Neural Networks - Decision and Control, 1995., Proceedings of the 34th IEEE Conference on
I n this short paper, some globally asymptotical stability criteria for the equilibrium states of a class of discrete-time dynamic neural networks with continuous states and asymmetrical weight matrices are presented. The resulting stability criteria are represented by either the existence of the positive daagonal solutions of the Lyapunov equations or some inequalities. Finally, some examples ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995